If a Graph Structured Stack contains {1,2,3,4} {1,5,3,4} {1,6,7,4} and {8,9,7,4}, what would be the source and sink vertices of the DAC?

  1. Home
  2. Back

Question:
 If a Graph Structured Stack contains {1,2,3,4} {1,5,3,4} {1,6,7,4} and {8,9,7,4}, what would be the source and sink vertices of the DAC?

1.Source – 1, 8 Sink – 7,4

2.Source – 1 Sink – 8,4

3.Source – 1, 8 Sink – 4

4.Source – 4, Sink – 1,8

Posted Date:-2022-05-13 10:20:27

More MCQS Questions and answers

  1. If a Graph Structured Stack contains {1,2,3,4} {1,5,3,4} {1,6,7,4} and {8,9,7,4}, what would be the source and sink vertices of the DAC?
  2. A connected planar graph having 6 vertices, 7 edges contains _____________ regions.
  3. A Graph Structured Stack is a _____________
  4. A man wants to go different places in the world. He has listed them down all. But there are some places where he wants to visit before some other places. What application of graph can he use to determine that?
  5. And Inverter Graph is a type of __________
  6. Binary Decision Diagram is a type of __________
  7. Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?
  8. Consider a situation of writing a binary tree into a file with memory storage efficiency in mind, is array representation of tree is good?
  9. Express -15 as a 6-bit signed binary number.
  10. Given an array of element 5, 7, 9, 1, 3, 10, 8, 4. Which of the following are the correct sequences of elements after inserting all the elements in a min-heap?
  11. Graph Structured Stack finds its application in _____________
  12. How many children does a binary tree have?
  13. How many stacks are required for reversing a word algorithm?
  14. If a connected Graph (G) contains n vertices what would be the rank of its incidence matrix?
  15. If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________
  16. If the tree is not a complete binary tree then what changes can be made for easy access of children of a node in the array?
  17. In a Binary Decision Diagram, how many types of terminal exists?
  18. In a Binary Decision Diagrams 0 values by a _________ line and the 1 values are represented by a _________ line.
  19. In most of the cases, topological sort starts from a node which has __________
  20. In which of the following case does a Binary Decision Diagram is used for?
  21. Most Efficient Time Complexity of Topological Sorting is? (V – number of vertices, E – number of edges)
  22. Size of an And Inverter Graph is the number of _______ gates and the number of logic levels is number of ________ gates on the __________ path from a primary input to a primary output.
  23. The column sum in an incidence matrix for a directed graph having no self loop is __________
  24. The column sum in an incidence matrix for a simple graph is __________
  25. Time complexity to check if an edge exists between two vertices would be ___________
  26. Topological sort can be applied to which of the following graphs?
  27. Topological sort can be implemented by?
  28. Topological sort is equivalent to which of the traversals in trees?
  29. Topological sort of a Directed Acyclic graph is?
  30. What are the children for node ‘w’ of a complete-binary tree in an array representation?
  31. What are the dimensions of an incidence matrix?
  32. What are the set of functions that are to be executed to get the following output? cat
  33. What is the location of a parent node for any arbitary node i?
  34. What is the number of edges present in a complete graph having n vertices?
  35. What is the parent for a node ‘w’ of a complete binary tree in an array representation when w is not 0?
  36. What is/are the disadvantages of implementing tree using normal arrays?
  37. What will be the word obtained if the word “abbcabb” is reversed using a stack?
  38. When the topological sort of a graph is unique?
  39. Which is the most appropriate data structure for reversing a word?
  40. Which is the predefined method available in Java to convert decimal to binary numbers?
  41. Which of the following is not an application of topological sorting?
  42. Which of the following logical operation can’t be implemented by polynomial time graph manipulation algorithms using Binary Decision Diagrams?
  43. Which of the following properties does a simple graph not hold?
  44. Which of the following statements for a simple graph is correct?
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!